Ela a Note on the Least Eigenvalue of a Graph with given Maximum Degree
نویسنده
چکیده
This note investigates the least eigenvalues of connected graphs with n vertices and maximum degree ∆, and characterizes the unique graph whose least eigenvalue achieves the minimum among all the connected graphs with n vertices and maximum vertex degree ∆ > n 2 .
منابع مشابه
A note on the least eigenvalue of a graph with given maximum degree
This note investigates the least eigenvalues of connected graphs with n vertices and maximum degree ∆, and characterizes the unique graph whose least eigenvalue achieves the minimum among all the connected graphs with n vertices and maximum vertex degree ∆ > n 2 .
متن کاملEla Estimation of the Maximum Multiplicity of an Eigenvalue in Terms of the Vertex Degrees of the Graph of a Matrix
The maximum multiplicity among eigenvalues of matrices with a given graph cannot generally be expressed in terms of the degrees of the vertices (even when the graph is a tree). Given are best possible lower and upper bounds, and characterization of the cases of equality in these bounds. A by-product is a sequential algorithm to calculate the exact maximum multiplicity by simple counting.
متن کاملEla on the Least Signless Laplacian Eigenvalue of Some Graphs
For a graph, the least signless Laplacian eigenvalue is the least eigenvalue of its signless Laplacian matrix. This paper investigates how the least signless Laplacian eigenvalue of a graph changes under some perturbations, and minimizes the least signless Laplacian eigenvalue among all the nonbipartite graphs with given matching number and edge cover number, respectively.
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملEla Quadratic Forms on Graphs with Application to Minimizing the Least Eigenvalue of Signless Laplacian over Bicyclic Graphs
Given a graph and a vector defined on the graph, a quadratic form is defined on the graph depending on its edges. In order to minimize the quadratic form on trees or unicyclic graphs associated with signless Laplacian, the notion of basic edge set of a graph is introduced, and the behavior of the least eigenvalue and the corresponding eigenvectors is investigated. Using these results a characte...
متن کامل